The PSPACE-Completeness of Black-White Pebbling
نویسندگان
چکیده
The complexity of the black-white pebbling game has remained an open problem for 30 years. In this paper we show that the black-white pebbling game is PSPACE-complete.
منابع مشابه
Black-White Pebbling is PSPACE-Complete
The complexity of the Black-White Pebbling Game has remained an open problem for 30 years. It was devised to capture the power of non-deterministic space bounded computation. Since then it has been continuously studied and applied to problems in diverse areas of computer science including VLSI design and more recently propositional proof complexity. In 1983, determining its complexity was rated...
متن کاملAlgorithms & Complexity Results for Input & Unit Resolution
In this paper we explore the complexity of various problems pertaining to Input Resolution, a very restricted form of Resolution which requires that at least one input to every instance of the resolution rule be an input clause. This proof system is of practical interest because Input Resolution is equivalent to Unit Resolution, a popular subroutine used in many areas of computer science, espec...
متن کاملA On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. The typical approach has been to encode the pebble game played on a graph as a CNF formula...
متن کاملOn the Relative Strength of Pebbling and Resolution (Extended Abstract)
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. The typical approach has been to encode the pebble game played on a graph as a CNF formula...
متن کاملFractional Pebbling Game Lower Bounds
Fractional pebbling is a generalization of black-white pebbling introduced recently. In this reasearch paper we solve an open problem by proving a tight lower bound on the pebble weight required to fractionally pebble a balanced d-ary tree of height h. This bound has close ties with branching programs and the separation of P from NL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 39 شماره
صفحات -
تاریخ انتشار 2010